Euclidean minimum spanning trees and bichromatic closest pairs
نویسندگان
چکیده
منابع مشابه
Planar bichromatic minimum spanning trees
Given a set S of n red and blue points in the plane, a planar bichromatic minimum spanning tree is the shortest possible spanning tree of S, such that every edge connects a red and a blue point, and no two edges intersect. Computing this tree is NP-hard in general. We present an O(n) time algorithm for the special case when all points are in convex position. For the general case, we present a f...
متن کاملHomogeneity Analysis Using Euclidean Minimum Spanning Trees
In the usual forms of homogeneity analysis (which are also known as multiple correspondence analysis or MCA) the size of a point set is defined as the size of the star plot of the set. The star plot is the graph defined by connecting all points in the set with their centroid, and the size is the total squared length of the edges. In order to prevent trivial solutions the configuration X is usua...
متن کاملDynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in amortized time O(n1/2 log n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n) per update. Our algorithm uses a novel construction, the ordered nearest neighbor path of a set of points. Our results generalize to higher d...
متن کاملApproximating k-hop Minimum Spanning Trees in Euclidean Metrics
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are interested in computing a rooted spanning tree of minimum cost such that the longest root-leaf path in the tree has at most k edges. We present a polynomial-time approximation scheme for the plane. Our algorithm is based on Ar...
متن کاملOn the Area Requirements of Euclidean Minimum Spanning Trees
In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1992], Monma and Suri proved that any tree of maximum degree 5 admits a planar embedding as a Euclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that c × c area is sometimes required to embed an n-vertex tree of maximum degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1991
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02574698